1. Identity statement | |
Reference Type | Book Section |
Site | mtc-m21c.sid.inpe.br |
Holder Code | isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S |
Identifier | 8JMKD3MGP3W34R/3STAKJB |
Repository | sid.inpe.br/mtc-m21c/2019/03.13.14.03 (restricted access) |
Last Update | 2019:03.13.14.03.24 (UTC) administrator |
Metadata Repository | sid.inpe.br/mtc-m21c/2019/03.13.14.03.24 |
Metadata Last Update | 2022:08.22.23.20.43 (UTC) administrator |
Secondary Key | INPE--/ |
DOI | 10.1007/978-0-387-34897-1_58 |
ISBN | 978-1-4757-6671-4 978-0-387-34897-1 (eBook) |
Citation Key | LorenaLope:1996:DyLiHe |
Title | A dynamic list heuristic for 2D-cutting |
Year | 1996 |
Access Date | 2024, May 06 |
Secondary Type | PRE LI |
Number of Files | 1 |
Size | 456 KiB |
|
2. Context | |
Author | 1 Lorena, Luiz Antonio Nogueira 2 Lopes, Fábio Belo |
Group | 1 LAC-INPE-MCT-BR 2 LAC-INPE-MCT-BR |
Affiliation | 1 Instituto Nacional de Pesquisas Espaciais (INPE) 2 Instituto Nacional de Pesquisas Espaciais (INPE) |
Editor | Dolezal, Jaroslav Fidler, Jiri |
Book Title | System modelling and optimization: Proceedings of the Seventeenth IFIP TC7 Conference on System Modelling and Optimization, 1995 |
Publisher | Springer |
Pages | 481-488 |
History (UTC) | 2019-03-13 14:03:54 :: simone -> administrator :: 1996 2022-03-08 15:27:24 :: administrator -> simone :: 1996 2022-03-09 18:13:09 :: simone -> administrator :: 1996 2022-08-22 23:20:43 :: administrator -> simone :: 1996 |
|
3. Content and structure | |
Is the master or a copy? | is the master |
Content Stage | completed |
Transferable | 1 |
Content Type | External Contribution |
Version Type | publisher |
Keywords | Cutting Stock Heuristics Best-first search Tabu search |
Abstract | We present a new heuristic for the 2D-cutting problem, called Dynamic List Heuristic (DLH). The objective is to eliminate the combinatorial explosion of the all rectangle combination's type heuristics, maintaining their good results of reduced waste. Algorithm DLH uses a dynamic list of constructed patterns, included and deleted at convenient times. DLH is based on the A * approach, a best-first tree of candidate solutions, and the use of an auxiliary tabu list for alternate best patterns to avoid excessive repetition. The computational tests for some problems of the literature and many random generated problems, confirm good results using microcomputers. |
Area | COMP |
Arrangement | urlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > A dynamic list... |
doc Directory Content | access |
source Directory Content | there are no files |
agreement Directory Content | |
|
4. Conditions of access and use | |
Language | en |
Target File | lorena_dynamic.pdf |
User Group | simone |
Reader Group | administrator simone |
Visibility | shown |
Read Permission | deny from all |
Update Permission | not transferred |
|
5. Allied materials | |
Mirror Repository | urlib.net/www/2017/11.22.19.04.03 |
Next Higher Units | 8JMKD3MGPCW/3ESGTTP |
Citing Item List | sid.inpe.br/bibdigital/2013/09.22.23.14 4 |
Dissemination | BNDEPOSITOLEGAL |
Host Collection | urlib.net/www/2017/11.22.19.04 |
|
6. Notes | |
Empty Fields | archivingpolicy archivist callnumber city copyholder copyright creatorhistory descriptionlevel e-mailaddress edition electronicmailaddress format issn label lineage mark nextedition notes numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project resumeid rightsholder schedulinginformation secondarydate secondarymark serieseditor seriestitle session shorttitle sponsor subject tertiarymark tertiarytype translator url volume |
|
7. Description control | |
e-Mail (login) | simone |
update | |
|